Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
نویسندگان
چکیده
Article history: Received 29 December 2007 Received in revised form 5 May 2008 Accepted 26 October 2008
منابع مشابه
Fault-free Hamiltonian Cycles in Alternating Group Graphs with Conditional Edge Faults
The alternating group graph, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. In this paper, adopting the conditional fault model in which each vertex is assumed to be incident with two or more fault-free edges, we show that an n-dimensional alternating group graph can tolerate up to 4n − 13 edge faults, w...
متن کاملPanconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
Jwo et al. [Networks 23 (1993) 315–326] introduced the alternating group graph as an interconnection network topology for computing systems. They showed that the proposed structure has many advantages over n-cubes and star graphs. For example, all alternating group graphs are hamiltonian-connected (i.e., every pair of vertices in the graph are connected by a hamiltonian path) and pancyclic (i.e...
متن کاملAn Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs
The enhanced pyramid graph was recently proposed as an interconnection network model in parallel processing for maximizing regularity in pyramid networks. We prove that there are two edge-disjoint Hamiltonian cycles in the enhanced pyramid networks. This investigation demonstrates its superior property in edge fault tolerance. This result is optimal in the sense that the minimum degree of the g...
متن کاملWirelength of 1-fault hamiltonian graphs into wheels and fans
In this paper we obtain a fundamental result to find the exact wirelength of 1-fault hamiltonian graphs into wheels and fans. Using this result we compute the exact wirelength of circulant graphs, generalized petersen graphs, augmented cubes, crossed cubes, mőbius cubes, locally twisted cubes, twisted cubes, twisted n-cubes, generalized twisted cubes, hierarchical cubic networks, alternating gr...
متن کاملPanpositionable hamiltonicity of the alternating group graphs
The alternating group graph AGn is an interconnection network topology based on the Cayley graph of the alternating group. There are some interesting results concerning the hamiltonicity and the fault tolerant hamiltonicity of the alternating group graphs. In this article, we propose a new concept called panpositionable hamiltonicity. A hamiltonian graph G is panpositionable if for any two diff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Sci.
دوره 179 شماره
صفحات -
تاریخ انتشار 2009